Hyperelliptic Pairings
نویسندگان
چکیده
We survey recent research on pairings on hyperelliptic curves and present a comparison of the performance characteristics of pairings on elliptic curves and hyperelliptic curves. Our analysis indicates that hyperelliptic curves are not more efficient than elliptic curves for general pairing applications.
منابع مشابه
Pairings on hyperelliptic curves
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many direction...
متن کاملPairings on Hyperelliptic Curves with a Real Model
We analyse the efficiency of pairing computations on hyperelliptic curves given by a real model using a balanced divisor at infinity. Several optimisations are proposed and analysed. Genus two curves given by a real model arise when considering pairing friendly groups of order dividing p − p + 1. We compare the performance of pairings on such groups in both elliptic and hyperelliptic versions. ...
متن کاملImproved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves
We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing on hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for evaluating them are deterministic and do not depend on a random choice of points. Our algorithm to evaluate the squared Weil pairing is about 20% more efficient tha...
متن کاملID-Based Blind Signature and Ring Signature from Pairings
Recently the bilinear pairing such as Weil pairing or Tate pairing on elliptic curves and hyperelliptic curves have been found various applications in cryptography. Several identity-based (simply ID-based) cryptosystems using bilinear pairings of elliptic curves or hyperelliptic curves were presented. Blind signature and ring signature are very useful to provide the user’s anonymity and the sig...
متن کاملAlgorithmes et arithmétique pour l'implémentation de couplages cryptographiques
Pairings are cryptographic primitives which are now used in numerousprotocols. Computing and implementing them efficiently is then an interestingchallenge relying on an algorithmic and arithmetic study of those mathematicalfunctions.More precisely, pairings are bilinear maps defined over elliptic and hyperellipticcurves. Among those, we restrict our study to supersingular cu...
متن کامل